Combination Algorithm of Probabilistic Argumentation Systems Based on Evidence Theory

Probabilistic Argumentation Systems is an alternative approach for non-monotonic reasoning under uncertainty. It can judge an unknown question in terms of the degree of support and that of possibility about probabilistic entailment. The resulting degree of support and degree of possibility correspond to belief and plausibility, respectively, in the Dempster-Shafer theory of evidence. But the system would result in absurd conclusion because of losing some valuable information in the course of transformation. To overcome this defect, this paper brings forth combination algorithm of Probabilistic Argumentation Systems to avoid the loss of information by using the validity of the decomposition model with conjunction of multi-atomic sets for probabilistic logic reasoning. An illustrative example shows the validity of the proposed method. KeywordsProbabilistic Argumentation Systems; Dempester-Shafer Theory; Combination Algorithm